Threshold cryptosystem with multiple secret sharing policies - Computers and Digital Techniques, IEE Proceedings-

نویسندگان

  • L. Harn
  • H.-Y. Lin
چکیده

In a group-oriented threshold cryptosystem, each group, instead of each individual member within the group, publishes a single group public key. An outsider can use this group public key to send encrypted messages to the group. However, the received encrypted messages can only be decrypted properly when the number of participating members is larger than or equal to the threshold value. All earlier solutions assume that there is only one secret sharing policy (i.e. one threshold value). We propose the first threshold cryptosystem with multiple secret sharing policies. In other words, a group can set up multiple secret sharing policies and a trusted key centre is responsible for selecting three publicly-known moduli, secret keys for group members, and publishing a corresponding public key for each policy during the initiation time. Moreover, there is only one single secret key kept by each group member. Whenever an outside wants to send a message to the group, he needs to determine how the message should be revealed to the group members, and therefore selects a proper public key to encrypt messages. Once the encrypted message is received by the group, according to the specified information, a predetermined number of group members is required to decipher the cipher-text. The ElGamal encryption scheme is used in the system with some modifications.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computationally secure multiple secret sharing: models, schemes, and formal security analysis

A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...

متن کامل

Mapping single and multiple multilevel structures onto the hypercube - Computers and Digital Techniques [see also IEE Proceedings-Computers and Digital Techniques], IEE

The paper introduces algorithms that map single and multiple multilevel structures onto the hypercube. For the case of the pyramid, which is a special multilevel structure, it is shown that a new algorithm is a compromise among existing algorithms with regard to cost and performance. Comparative analysis of the algorithms is carried out using analytical techniques and simulation results.

متن کامل

An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves

‎In a (t,n)-threshold secret sharing scheme‎, ‎a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together‎, ‎but no group of fewer than t participants can do‎. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao‎, ‎and the intractability of the elliptic curve discrete logar...

متن کامل

CMOS ternary flip-flops and their applications - Computers and Digital Techniques [see also IEE Proceedings-Computers and Digital Techniques], IEE

We demonstrate a procedure for designing CMOS ternary circuits based on a discussion of threshold comparison, transmission, and union Qperations. Using some basic CMOS ternary circuits, we design CMOS ternary flip-flops (tri-flops) such as ternary latch and various master/slave triflops. These tri-flops have two additional binary inverse outputs with a fixed threshold. As examples of sequential...

متن کامل

Security Analysis of a Hash-Based Secret Sharing Scheme

Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009